Latent Partition Implicit with Surface Codes for 3D Representation

نویسندگان

چکیده

Deep implicit functions have shown remarkable shape modeling ability in various 3D computer vision tasks. One drawback is that it hard for them to represent a as multiple parts. Current solutions learn primitives and blend the directly spatial space, which still struggle approximate accurately. To resolve this problem, we introduce novel representation single set of parts latent towards both highly accurate plausibly interpretable modeling. Our insight here part learning blending can be conducted much easier space than space. We name our method Latent Partition Implicit (LPI), because its casting global into local modeling, partitions unity. LPI represents Signed Distance Functions (SDFs) using surface codes. Each code representing whose center on surface, enables us flexibly employ intrinsic attributes shapes or additional properties. Eventually, reconstruct shape, are plausible meshes. multi-level representation, partition different numbers after training. learned without ground truth signed distances, point normals any supervision partition. outperforms latest methods under widely used benchmarks terms reconstruction accuracy interpretability. code, data models available at https://github.com/chenchao15/LPI .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Partition of Unity Implicit Surface Reconstruction

We consider the problem of infer a shape of a geometric object from a finite set of sample points with normals. Our contribution is to present a new scheme for Implicit Surface Reconstruction based on a domain decomposition technique known as multilevel partition of unity (MPU) which hierarchically divides the domain in parts obtaining local approximation for the object on each part, and then p...

متن کامل

Multiresolution Implicit Representation of 3D Objects

This paper presents a generic technique for converting any 3D object into an implicit representation, based on multiresolution implicit grids. A specific hash table structure is proposed, which permits compact storage as well as easy hierarchical evaluation of the object. Finally, a tessellator for these multiresolution implicit objects is presented, that takes advantage of the hash table struc...

متن کامل

3D Model Segmentation and Representation with Implicit Polynomials

SUMMARY When large-scale and complex 3D objects are obtained by range finders, it is often necessary to represent them by algebraic surfaces for such purposes as data compression, multi-resolution, noise elimination, and 3D recognition. Representing the 3D data with algebraic surfaces of an implicit polynomial (IP) has proved to offer the advantages that IP representation is capable of encoding...

متن کامل

3D Surface Parameterization Using Manifold Learning for Medial Shape Representation

The choice of 3D shape representation for anatomical structures determines the effectiveness with which segmentation, visualization, deformation, and shape statistics are performed. Medial axis-based shape representations have attracted considerable attention due to their inherent ability to encode information about the natural geometry of parts of the anatomy. In this paper, we propose a novel...

متن کامل

Efficient surface-aware ray tracing based on implicit model representation

We propose a novel surface-aware ray tracing method based on implicit model representation. Each horizon is represented by a signed distance field and the spatial relationships between horizons are described by a stratigraphic binary tree. With this kind of implicit representation, complex structural model (e.g., heavily faulted, intrusions and unconformities) are easily handled, and the veloci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-20062-5_19